Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
401	Computational Balloon Twisting: The Theory of Balloon Polyhedra Erik D. Demaine∗ Martin L. Demaine∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:08:28 Polyhedron Octahedron Eulerian path Induced path Matching Route inspection problem Line graph Edge coloring Graph theory Planar graphs NP-complete problems
402	Algorithms: Complexity Classes and Lower Bounds Martin Held FB Computerwissenschaften Universität Salzburg A-5020 Salzburg, Austria Add to Reading List Source URL: www.cosy.sbg.ac.at Language: English - Date: 2014-10-17 01:42:07 Complexity classes P versus NP problem NP P Low EXPTIME NC Parameterized complexity Karp–Lipton theorem Theoretical computer science Computational complexity theory Applied mathematics
403	CCCG 2009, Vancouver, BC, August 17–19, 2009 Wireless Localization with Vertex Guards is NP-hard Tobias Christ∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:33:40 Vertex Polygon Polytopes Geometry Art gallery problem Computational geometry
404	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-01-05 09:50:09 Complexity classes Approximation algorithms NP-complete problems Matroid theory Generalized assignment problem Knapsack problem Submodular set function APX Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
405	Faster Construction of Planar Two-centers David Eppstein∗ Abstract tical implementation. The method is complicated, and Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1997-12-08 20:38:05 Analysis of algorithms Computational geometry Probabilistic complexity theory Randomized algorithm Algorithm Time complexity Binary search algorithm LP-type problem Closest pair of points problem Theoretical computer science Applied mathematics Mathematics
406	CCCG 2010, Winnipeg MB, August 9–11, 2010 Constrained k-center and Movement to Independence Adrian Dumitrescu∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Operations research NP-complete problems Approximation algorithm Computational complexity theory Facility location Circle Travelling salesman problem Tower of Hanoi Theoretical computer science Geometry Mathematics
407	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Optimal schedules for 2-guard room search Stephen Bahun∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:26:35 Polygons Network theory Discrete geometry Computational geometry Shortest path problem Simple polygon Visibility Voronoi diagram Vertex Geometry Mathematics Euclidean plane geometry
408	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Data Structures for Range-Aggregate Extent Queries Prosenjit Gupta∗ Ravi Janardan† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:05:03 Bin Fractional cascading Closest pair of points problem R-tree FO Voronoi diagram Discrete mathematics Mathematics Geometry Computational geometry
409	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics S¨oren Laue∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:24:48 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
410	Packing Resizable Items with Application to Video Delivery over Wireless Networks∗ Sivan Albagli-Kim† Leah Epstein‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-07-08 12:40:54 NP-complete problems Operations research Combinatorial optimization Bin packing problem Knapsack problem Packing problem Algorithm Theoretical computer science Computational complexity theory Mathematics

UPDATE